An Improved Round Robin Approach using Dynamic Time Quantum for Improving Average Waiting Time
نویسندگان
چکیده
منابع مشابه
Improving Waiting Time of Tasks Scheduled Under Preemptive Round Robin Using Changeable Time Quantum
Minimizing waiting time for tasks waiting in the queue for execution is one of the important scheduling criteria which took a wide area in scheduling preemptive tasks. In this paper we present Changeable Time Quantum (CTQ) approach combined with the round-robin algorithm, we try to adjust the time quantum according to the burst times of the tasks in the ready queue. There are two important bene...
متن کاملAn Efficient Approach to Calculate Dynamic Time Quantum in Round Robin Algorithm for Efficient Load Balancing
Cloud computing is one of the most emerging technologies in the world. Cloud service providers deals with huge amount of data and processes huge number of requests. It faces various challenges. Load ballancing is one of the major challenges. Load ballancing is basically the distribution of the tasks among different nodes for perfect utilization of resources and time. Different techniques have b...
متن کاملA New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average
Round Robin, considered as the most widely adopted CPU scheduling algorithm, undergoes severe problems directly related to quantum size. If time quantum chosen is too large, the response time of the processes is considered too high. On the other hand, if this quantum is too small, it increases the overhead of the CPU. In this paper, we propose a new algorithm, called AN, based on a new approach...
متن کاملMulti-queue CPU Process Prioritization using a Dynamic Quantum Time Algorithm Compared with Varying Time Quantum and Round-Robin Algorithms
In Round-Robin Scheduling, the quantum time is static and tasks are scheduled such that no process uses CPU time more than one slice time each cycle. If quantum time is too large, the response time of the processes will not be tolerated in an interactive environment. If quantum the time is too small, unnecessary frequent context switch may occur. Consequently, overheads result in fewer throughp...
متن کاملCPU Burst Processes Prioritization Using Priority Dynamic Quantum Time Algorithm: A Comparison with Varying Time Quantum and Round Robin Algorithms
In Round-Robin Scheduling, the time quantum is fixed and processes are scheduled such that no process uses CPU time more than one time quantum in one go. If time quantum is too large, the response time of the processes will not be tolerated in an interactive environment. If the time quantum is too small, unnecessary frequent context switch may occur. Consequently, overheads result in fewer thro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2013
ISSN: 0975-8887
DOI: 10.5120/11909-8007